PointGrid Class Reference

Detailed Description

A divide-and-conquer algorithm is used to find FatPoints that overlap:

• It uses a grid 'mGrid' covering the space, initialized by setGrid() To each point on mGrid is associated a list of FatPoint* of class PointGridCell.
• The functions 'add()' position the given FatPoints on the grid
• Function setStericInteraction() uses mGrid to find pairs of FatPoints that may overlap. It then calculates their actual distance, and set a interaction from Meca if necessary

Public Member Functions
	PointGrid ()
	creator
virtual	~PointGrid ()
	destructor
void	setGrid (Space const *, Modulo const *, real min_step)
	create a grid to cover the specified Space, with cell of size min_step at least
bool	hasGrid () const
	true if the grid was initialized by calling setGrid()
void	clear ()
	clear the grid
void	add (PointExact const &p, real radius) const
	place PointExact on the grid
void	add (FiberLocus const &p, real radius, real extra_range) const
	place FiberLocus on the grid
void	setInteractions (Meca &, PointGridParam const &pam) const
	enter interactions into Meca between two panes with given stiffness More...

Member Function Documentation

void setInteractions	(	Meca &	meca,
		PointGridParam const &	pam
	)		const

Check interactions between the FatPoints contained in Pane pan1, and pan2.